Fp-tree Based Spatial Co-location Pattern Mining

A co-location pattern is a set of spatial features frequently located together in space. A frequent pattern is a set of items that frequently appears in a transaction database. Since its introduction, the paradigm of frequent pattern mining has undergone a shift from candidate generation-and-test based approaches to projection based approaches. Co-location patterns resemble frequent patterns in many aspects. However, the lack of transaction concept, which is crucial in frequent pattern mining, makes the similar shift of paradigm in co-location pattern mining very difficult. This thesis investigates a projection based co-location pattern mining paradigm. In particular, a FP-tree based co-location mining framework and an algorithm called FP-CM, for FP-tree based co-location miner, are proposed. It is proved that FP-CM is complete, correct, and only requires a small constant number of database scans. The experimental results show that FP-CM outperforms candidate generation-and-test based co-location miner by an order of magnitude. ii ACKNOWLEDGEMENTS This thesis would not have been finished without my research advisor, Dr. Yan Huang. I would like to thank her for her continuous encouragement and support during my work on the thesis. I would also like to thank Dr. Mikler and Dr. Brazile for their help and being on my thesis committee. I also thank my family and friends for their support throughout these years.